Dynamic Rendezvous Based Routing Algorithm on Sparse Opportunistic Network Environment
نویسندگان
چکیده
منابع مشابه
Network Coding Based Multipath Opportunistic Routing Algorithm for Satellite Networks
Satellite networks could offer global communication without need of terrestrial infrastructure. Network coding could exploit the shared nature of wireless medium to improve network throughput. In this paper, we combine the satellite network routing algorithm with network coding, proposing a novel Network Coding based Multipath Opportunistic Routing Algorithm (NC-MORA) for Satellite Networks. Th...
متن کاملEfficient Clustering Routing Algorithm Based on Opportunistic Routing
Based on the analysis of the existing classic clustering routing algorithm HEED, this paper proposes an efficient dynamic clustering routing algorithm ED-HEED. In the cluster selection process, in order to optimize the network topology and select more proper nodes as the cluster head, the proposed clustering algorithm considers the shortest path prediction of the node to the destination sink an...
متن کاملOpportunistic Routing in Delay Tolerant Network with Different Routing Algorithm
Present new mechanisms for modelling multiple interfaces on a node, support for interference-limited links and a framework for modelling complex applications running on the nodes. Furthermore, provide an overview of concrete use cases where the simulator has been successfully exploited to study a variety of aspects related to opportunistic, message-based communications. Node movement is impleme...
متن کاملExploring and Exploiting Opportunistic Network Routing in a DTN Environment
A communications network that is capable of storing packets temporarily in intermediate nodes, until the time an end-to-end route is re-established or regenerated is known as a delay tolerant network/s, in short, DTN. This paper aims to detail basic & general aspects specific to information needs in DTN routing and present classification chart. We start with evolution of some relevant routing o...
متن کاملA Dynamic Bootstrap Mechanism for Rendezvous-based Multicast Routing
Current multicast routing protocols can be classi ed into three types according to how the multicast tree is established broadcast and prune e g DVMRP PIM DM membership ad vertisement e g MOSPF and rendezvous based e g CBT PIM SM Rendezvous based protocols associate with each logical multicast group address a physical unicast address re ferred to as the core or rendezvous point RP Members rst j...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Distributed Sensor Networks
سال: 2015
ISSN: 1550-1477,1550-1477
DOI: 10.1155/2015/819178